Fluid queues with heavy - tailed M / G / infinity input
نویسنده
چکیده
We consider a fluid queue fed by several heterogeneous M / G / 00 input processes with regularly varying session lengths. Under fairly mild assumptions, we derive the exact asymptotic behavior of the stationary workload distribution. As a by-product, we obtain asymptotically tight bounds for the transient workload distribution. The results are strongly inspired by the large-deviations idea that overflow is typically due to some minimal combination of extremely long concurrent sessions causing positive drift. The typical configuration of long sessions is identified through a simple integer program, paving the way for the exact computation of the asymptotic workload behavior. The calculations provide crucial insight in the typical overflow scenario. 2000 Mathematics Subject Classification: 60K25 (primary), 60FIO, 90B18, 90B22 (secondary).
منابع مشابه
Coupled Processors with Regularly Varying Service Times
Consider two M=G=1 queues that are coupled in the following way. Whenever both queues are non-empty, each server serves its own queue at unit speed. However, if server 2 has no work in its own queue, then it assists server 1, resulting in an increased service speed r 1 1 in the first queue. This kind of coupling is related to generalized processor sharing. We assume that the service request dis...
متن کاملLimits for Cumulative Input Processes to Queues
We establish functional central limit theorems (FCLTs) for a cumulative input process to a fluid queue from the superposition of independent on-off sources, where the on periods and off periods may have heavy-tailed probability distributions. Variants of these FCLTs hold for cumulative busy time and idle time processes associated with standard queueing models. The heavy-tailed on-period and off...
متن کاملNumerical Methods for Analyzing Queues with Heavy-Tailed Distributions
In many Internet-type queues, arrival and service distributions are heavy-tailed. A difficulty with analyzing these queues is that heavy-tailed distributions do not generally have closed-form Laplace transforms. A recently proposed method, the Transform Approximation Method (TAM), overcomes this by numerically approximating the transform. This paper investigates numerical issues of implementing...
متن کاملPatterns of Buffer Overflow in a Class of Queues with Long Memory in the Input Stream
We study the time it takes until a a uid queue with a nite, but large, holding capacity reaches the overrow point. The queue is fed by an on/oo process, with a heavy tailed on distribution, which is known to have long memory. It turns out that the expected time until overrow, as a function of capacity L, increases only polynomially fast, and so overrows happen much more often than in the \class...
متن کاملTwo-node fluid network with a heavy-tailed random input: the strong stability case
We consider a two-node fluid network with batch arrivals of random size having a heavy-tailed distribution. We are interested in the tail asymptotics for the stationary distribution of a two-dimensional queue-length process. The tail asymptotics have been well studied for two-dimensional reflecting processes where jumps have either a bounded or an unbounded light-tailed distribution. However, p...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2017